Upward Straight-Line Embeddings of Directed Graphs into Point Sets

Upward Geometric Graph Embeddings into Point Sets

We study the problem of characterizing the directed graphs with an upward straightline embedding into every point set in general or in convex position. We solve two questions posed by Binucci et al. [Computational Geometry: Theory and Applications, 2010 ]. Namely, we prove that the classes of directed graphs with an upward straightline embedding into every point set in convex position and with ...

Directed Graphs with an Upward Straight-line Embedding into Every Point Set

In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is mapped to a point of S, each edge is drawn as a straight-line segment, and all the edges are oriented according to a common direction. We characterize the family of directed graphs that admit an upward straight-line embed...

On Directed Graphs with an Upward Straight-line

In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is mapped to a point of S, each edge is drawn as a straight-line segment, and all the edges are oriented according to a common direction. We characterize the family of directed graphs that admit an upward straight-line embed...

Straight Line Embeddings of Planar Graphs on Point Sets

On the Perspectives Opened by Right Angle Crossing Drawings

Right Angle Crossing (RAC) drawings are polyline drawings where each crossing forms four right angles. RAC drawings have been introduced because cognitive experiments provided evidence that increasing the number of crossings does not decrease the readability of a drawing if edges cross at right angles. We investigate to what extent RAC drawings can help in overcoming the limitations of widely a...